Automatic summation using Zeilberger-Wilf theory
نویسنده
چکیده
was tot voor kort alleen mogelijk met behulp van behoorlijk wat menselijke slimheid en inventiviteit. Echter, computers kunnen dergelijke uitdrukkingen nu ook vinden; het probleem wanneer een hypergeometrische som is uit te drukken in gesloten vorm is geheel opgelost. Andries Brouwer beschrijft het proces van de zogenaamde automatische sommering. Het is gebaseerd op theorieën van Zeilberger en Wilf.
منابع مشابه
Three Recitations on Holonomic Systems and Hypergeometric Series
When we teach calculus we have lectures and recitations. These notes are meant as “recitations” or something like “Schaum outlines” for the theory. The role of the “lectures” or “textbook” is provided by Gosper’s path-breaking paper “A Decision Procedure for Indefinite summation”, Proc. Nat. Acad. Sci. USA 75 (1978), 40-42, and by the following papers by myself and my collaborators, Gert Almkvi...
متن کاملAlgorithms for the Indefinite and Definite Summation
The celebrated Zeilberger algorithm which finds holonomic recurrence equations for definite sums of hypergeometric terms F (n, k) is extended to certain nonhypergeometric terms. An expression F (n, k) is called hypergeometric term if both F (n + 1, k)/F (n, k) and F (n, k+1)/F (n, k) are rational functions. Typical examples are ratios of products of exponentials, factorials, Γ function terms, b...
متن کاملHow to generate all possible rational Wilf-Zeilberger pairs?
A Wilf–Zeilberger pair (F,G) in the discrete case satisfies the equation F(n+ 1,k)−F(n,k) = G(n,k+ 1)−G(n,k). We present a structural description of all possible rational Wilf–Zeilberger pairs and their continuous and mixed analogues.
متن کاملA Mathematica Version of Zeilberger's Algorithm for Proving Binomial Coefficient Identities
Gosper’s algorithm for indefinite hypergeometric summation, see e.g. Gosper (1978) or Lafon (1983) or Graham, Knuth and Patashnik (1989), belongs to the standard methods implemented in most computer algebra systems. Exceptions are, for instance, the 2.xVersions of the Mathematica system where symbolic summation is done by different means. A brief discussion is given in section 5. Current intere...
متن کاملViii. Final Perspectives Viii.6 Advice to a Young Mathematician
Borwein, J., D. H. Bailey, and R. Girgensohn. 2004. Experimentation in Mathematics: Computational Paths to Discovery. Wellesley, MA: A. K. Peters. Calkin, N., and H. S. Wilf. 2000. Recounting the rationals. American Mathematical Monthly 107:360–63. Ferguson, H. R. P., and R. W. Forcade. 1979. Generalization of the Euclidean algorithm for real numbers to all dimensions higher than two. Bulletin ...
متن کامل